|
In numerical analysis, Laguerre's method is a root-finding algorithm tailored to polynomials. In other words, Laguerre's method can be used to numerically solve the equation : for a given polynomial ''p''. One of the most useful properties of this method is that it is, from extensive empirical study, very close to being a "sure-fire" method, meaning that it is almost guaranteed to always converge to ''some'' root of the polynomial, no matter what initial guess is chosen. This method is named in honour of Edmond Laguerre, a French mathematician. ==Definition== The algorithm of the Laguerre method to find one root of a polynomial ''p'' of degree ''n'' is: * Choose an initial guess * For ''k'' = 0, 1, 2, … * * If is very small, exit the loop * * Calculate * * Calculate * * Calculate * Repeat until ''a'' is small enough or if the maximum number of iterations has been reached. If a root has been found, the corresponding linear factor can be removed from ''p''. This deflation step reduces the degree of the polynomial by one, so that eventually, approximations for all roots of ''p'' can be found. Note however that deflation can lead to approximate factors that differ significantly from the corresponding exact factors. This error is least if the roots are found in the order of increasing magnitude. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Laguerre's method」の詳細全文を読む スポンサード リンク
|